Operations on Multiple Transition Faults without Enumeration
نویسندگان
چکیده
منابع مشابه
Cardinality without Enumeration
We show that the notion of cardinality of a set is independent from that of wellordering, and that reasonable total notions of cardinality exist in every model of ZF where the axiom of choice fails. Such notions are either definable in a simple and natural way, or nondefinable, produced by forcing. Analogous cardinality notions exist in nonstandard models of arithmetic admitting nontrivial auto...
متن کاملDiagnosing Multiple Faults
Diagnostic tasks require determining the differences between a model of an artifact and the artifact itself. The differences between the manifested behavior of the artifact and the predicted behavior of the model guide the search for the differences between the artifact and its model. The diagnostic procedure presented in this paper is model-based, inferring the behavior of the composite device...
متن کاملSynchronizing Operations on Multiple Objects
Parallel programming on distributed memory systems is one of the most challenging research areas in parallel computing today. Objectbased parallel programming languages are an important class of languages for such systems. Shared objects allow the programmer to deal with data partitioning, communication, and synchronization in a highlevel manner. Synchronizing operations on a single object is w...
متن کاملOn Generating High Quality Tests for Transition Faults
ATS 2002 Integrated Test Scheduling, Test Parallelization and TAM Design Erik Larsson, Klas Arvidsson, Hideo Fujiwara and Zebo Peng On Generating High Quality Tests for Transition Faults Yun Shao, Irith Pomeranz and Sudhakar M. Reddy A Scheduling Method in High-Level Synthesis for Acyclic Partial Scan Design Tomoo Inoue, Tomokazu Miura, Akio Tamura, and Hideo Fujiwara Test Scheduling and Test A...
متن کاملNovel ATPG Algorithms for Transition Faults
This paper proposes novel algorithms for computing test patterns for transition faults in combinational circuits and fully scanned sequential circuits. The algorithms are based on the principle that s@ vectors can be effectively used to construct good quality transition test sets. Several algorithms are discussed. Experimental results obtained using the new algorithms show that there is a 20% r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: MATEC Web of Conferences
سال: 2016
ISSN: 2261-236X
DOI: 10.1051/matecconf/20167601012